The Schützenberger involution over Dyck paths

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An involution on Dyck paths and its consequences

An involution is introduced in the set of all Dyck paths of semilength n from which one re-obtains easily the equidistribution of the parameters 'number of valleys' and 'number of doublerises' and also the equidistribution of the parameters 'height of the first peak' and 'number of returns'. (~) 1999 Elsevier Science B.V. All rights reserved AMS classification: 05A15

متن کامل

On Generalized Dyck Paths

We generalize the elegant bijective proof of the Chung Feller theorem from the paper of Young-Ming Chen [The Chung-Feller theorem revisited, Disc. Math. 308 (2008), 1328–1329].

متن کامل

Counting Generalized Dyck Paths

The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from (0, 0) to (n, n) which is below the diagonal line y = x. One way to generalize the definition of Dyck path is to change the end point of Dyck path, i.e. we define (generalized) Dyck path to be a lattice path from (0, 0) to (m, n) ∈ N2 which is below the diagonal line y...

متن کامل

Pattern - avoiding Dyck paths †

We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P , we determine a formula for the number of Dyck paths covered by P , as well as for the ...

متن کامل

Domino tableaux, Schützenberger involution, and the symmetric group action

We define an action of the symmetric group S[ n 2 ] on the set of domino tableaux, and prove that the number of domino tableaux of weight β does not depend on the permutation of the weight β. A bijective proof of the well-known result due to J. Stembridge that the number of self–evacuating tableaux of a given shape and weight β = (β1, . . . , β[ n+1 2 ], β[ n2 ], . . . , β1), is equal to that o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2016

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2015.12.010